Linear Time Logics Around PSL: Complexity, Expressiveness, and a Little Bit of Succinctness
نویسنده
چکیده
We consider linear time temporal logic enriched with semiextended regular expressions through various operators that have been proposed in the literature, in particular in Accelera’s Property Specification Language. We obtain results about the expressive power of fragments of this logic when restricted to certain operators only: basically, all operators alone suffice for expressive completeness w.r.t. ω-regular expressions, just the closure operator is too weak. We also obtain complexity results. Again, almost all operators alone suffice for EXPSPACEcompleteness, just the closure operator needs some help.
منابع مشابه
The Relative Succinctness and Expressiveness of Modal Logics Can Be Arbitrarily Complex
We study the relative succinctness and expressiveness of modal logics, and prove that these relationships can be as complex as any countable partial order. For this, we use two uniform formalisms to define modal operators, and obtain results on succinctness and expressiveness in these two settings. Our proofs are based on formula size games introduced by Adler and Immerman and bisimulations.
متن کاملA Hierarchy for Accellera's Property Specification Language
Vorliegende Diplomarbeit wurde von mir selbstständig verfasst. Es wurden keine anderen als die angegebenen Quellen und Hilfsmittel benutzt. 6 Conclusion and Future Work 55 ii 1 Introduction 1.1 Motivation Model checking and equivalence checking are state-of-the-art in modern hardware circuit design. Moreover, standardised languages like the hardware description languages VHDL [4, 56] and Verilo...
متن کاملThe succinctness of first-order logic on linear orders (Full Version)
Succinctness is a natural measure for comparing the strength of different logics. Intuitively, a logic L1 is more succinct than another logic L2 if all properties that can be expressed in L2 can be expressed in L1 by formulas of (approximately) the same size, but some properties can be expressed in L1 by (significantly) smaller formulas. We study the succinctness of logics on linear orders that...
متن کاملOn the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-Width
Bit-precise reasoning is important for many practical applications of Satisfiability Modulo Theories (SMT). In recent years, efficient approaches for solving fixed-size bit-vector formulas have been developed. From the theoretical point of view, only few results on the complexity of fixed-size bit-vector logics have been published. Some of these results only hold if unary encoding on the bit-wi...
متن کاملSize-Change Termination and Satisfiability for Linear-Time Temporal Logics
In the automata-theoretic framework, finite-state automata are used as a machine model to capture the operational content of temporal logics. Decision problems like satisfiability, subsumption, equivalence, etc. then translate into questions on automata like emptiness, inclusion, language equivalence, etc. Linear-time temporal logics like LTL, PSL and the linear-time μ-calculus have relatively ...
متن کامل